Method, system, and computer readable medium for comparing phonetic similarity of return words to resolve ambiguities during voice recognition

ABSTRACT

In one embodiment, the invention provides a method for a speech recognition system to select a return value corresponding to a spoken input. The method comprises generating a dictionary comprising return values associated with data provisioned in the speech recognition system; generating a grammar for each return value in the dictionary; analyzing the grammar to determine a subset of return values from the dictionary that are likely alternatives for each return value in the dictionary, based on the grammar; selecting a return value corresponding to the spoken input based on the grammar; and if the selected return value is not confirmed by a user, then presenting the likely alternative for the selected return value to the user.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation from U.S. patent application Ser. No. 10/960,198, filed Oct. 6, 2004, entitled “METHOD, SYSTEM AND COMPUTER READABLE MEDIUM FOR COMPARING PHONETIC SIMILARITY OF RETURN WORDS TO RESOLVE AMBIGUITIES DURING VOICE RECOGNITION”, which is incorporated by reference herein in its entirety.

FIELD OF THE INVENTION

Embodiments of the invention relate to a speech recognition system, and in particular to the selection of a return value based on a spoken input to the speech recognition system.

BACKGROUND

Speech recognition systems have been successfully deployed to implement voice browsers where a user utters a spoken input to the system and the system recognizes the spoken input by selecting a return value associated with the spoken input.

The selection of the return value is based on a correlation between a digitized waveform of the spoken input with a waveform of a word or string in a grammar provisioned in the system. Once the system selects the return value, the system presents the selected return value to the user for confirmation. For example, in a travel context, a voice recognition system may have the following dialogue or conversation with a user:

-   -   System: “Please state your destination city.”     -   User: “Boston.”     -   System: “I heard Boston, is that right?”     -   User: “Yes.”

Since the user confirmed the return value of “Boston” in the above example, the system can continue the dialogue with the user.

If the user does not confirm the selected return value, then in one system known to the inventor, the system may simply repeat the dialogue or parts of it in the hope that the user may speak more clearly thereby to facilitate correct selection of the return value. The following conversation exemplifies this approach:

-   -   System: “Please state your destination city.”     -   User: “Boston.”     -   System: “I heard Austin, is that correct?”—A     -   User: “No, Boston.”—B     -   System: “I heard Austin, is that correct?”—C

In the above conversation, the parts labeled A, B, and C may be repeated until the user hangs up through sheer frustration or the system crashes.

In another system known to the inventor, in order to arrive at the correct return value, the system sequentially presents every possible return value provisioned in the system to the user for confirmation. With this approach, a sample conversation may take the following form:

-   -   System: “Please state your destination city.”     -   User: “Boston.”     -   System: “I heard Austin, is that correct?”     -   User: “No, Boston.”     -   System: “I heard Portland, is that correct?”     -   User: “No, Boston.”     -   System: “I heard Baltimore, is that correct?”     -   User: “No, Boston,” etc.

As a list of destination cities may comprise hundreds of return values, each corresponding to a city on the list, it will be appreciated that the above technique for selecting the correct return value (also known as the N-best approach) is also inadequate.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1-1I of the drawings show a table comprising a number of dictionary entries in accordance to one embodiment of the invention;

FIG. 2 of the drawings show a flowchart of operations performed by a speech recognition system in order to select a return value corresponding to an spoken input in accordance to one embodiment of the invention;

FIGS. 3-3M show the table of FIG. 1 updated to include a column of alternative returns values generated in accordance with one embodiment of the invention;

FIGS. 4A and B show an example of a consonant/vowel confusability matrix in accordance to one embodiment of the invention;

FIGS. 5A and B show an example of a matrix which is the output of a similarity comparison between strings, in accordance to one embodiment of the invention;

FIG. 6 shows a high-level block diagram of a speech recognition system in accordance to one embodiment of the invention;

FIG. 7 shows a flowchart of operations performed by a speech recognition system, in accordance to one embodiment of the invention;

FIG. 8 shows a high-level functional block diagram of a speech recognition system used to perform the operations shown in FIG. 7, in accordance to one embodiment of the invention; and

FIG. 9 shows a high-level block diagram of hardware that may be used to implement the speech recognition systems of the present invention.

DETAILED DESCRIPTION

Embodiments of the invention disclose a technique and a system to select a correct return value corresponding to a spoken input in an efficient manner. If a user does not confirm an initial selection of a return value, then alternative return values related to the selected return value are presented to the user for selection. In one embodiment, each alternative return value is related to the selected return value in terms of a phonetic similarity between a string in a grammar for the selected return value and a string in a grammar for the alternative return value. The determination of the alternative return values is, advantageously performed, in one embodiment, at compile time rather than at run time, thus allowing presentation of the alternative return values to the user with little latency or delay. Other advantages of the techniques and systems of the present invention will be apparent from the description below.

As used herein, the term “dictionary” refers to data provisioned in a speech recognition system. For example, a dictionary may comprise a list of drugs, a list of corporations, a list of doctors, dentists, etc. In general, given a spoken input, the speech recognition system selects one entry from the dictionary. The selected entry is known as the return value. Further, as used herein, the term “grammar” refers to all anticipated spoken options/input provisioned in the speech recognition system and corresponding to a particular dictionary entry.

For purposes of this description reference will be made to FIG. 1 of the drawings, which shows a table 100 in which column 102 shows dictionary entries comprising corporations, and column 104 shows a grammar corresponding to each dictionary entry. As will be seen from the table 100, the dictionary entry for “A O N Corporation” includes the following grammar: “A O N Corporation, Aon C S G, Aon Corp, Aon Corporation, Aon Insurance, Auto Insurance Specialists, Rish Services.” Another way of looking at the grammar is that it represents synonyms or aliases that a user may utter for a given dictionary entry.

FIG. 2 of the drawings shows a flowchart of operations performed by a speech recognition system in order to select a return value corresponding to a spoken input, in accordance with one embodiment of the invention. Referring to FIG. 2, at block 200 a dictionary comprising return values associated with data provisioned in the speech recognition system is generated. In other words, at block 200, the values for the column 102, in table 100 of FIG. 1, are produced. In one embodiment, in order to generate the dictionary, a user is provided with a “make dictionary” menu item, which can be selected in order to bring up a “get file” dialogue box, for which is used to select a text file containing the dictionary items. Thus, a file containing the dictionary items may be imported into the system.

At block 202, the system generates a grammar for each return value in the dictionary. In other words, the values for the column 104 in table 100 of FIG. 1 are generated at block 202. Operations performed at block 202 may include receiving manual input of the grammar for each return value.

The output of the operations performed at block 200, and block 202 is a table such as the table 100 of FIG. 1 of the drawings. Once the table is generated, the next step is for the system to analyze the grammar at block 204 to determine a subset of return values from the dictionary that are likely alternatives for each return value in the dictionary based on the grammar. In one embodiment, the output of the operations performed at block 204 is to generate a table 300 which has three columns, namely column 302, 304, and 306, as can be seen from FIG. 3 of the drawings. Columns 302 and 304 correspond to columns 102, and 104, respectively of table 100 of FIG. 1. The column 306 contains the alternative return values generated by analyzing the grammar step 204. In one embodiment, the subset of return values is generated by comparing pairs of strings from the grammar corresponding to the dictionary entries in order to determine the phonetic similarity between the strings. In one embodiment, each string in a given pair is from the grammar for a different dictionary entry. For example, in one embodiment the operations at block 204 may include performing the following algorithm:

-   -   for each dictionary entry;         -   for each string in the grammar for the dictionary entry;             -   compare the string with every other string in the                 dictionary that is not in the grammar for the dictionary                 entry.

Thus for example, each string in the grammar for the first dictionary entry “AON Corporation” would be compared to every other string in table 300 that is not a string in the grammar for “AON Corporation”.

In order to perform the comparison of the strings, the strings are first phoneticized or converted into their phonetic equivalents. In one embodiment this is done by utilizing algorithms utilized by text to speech systems. These systems use a combination of built-in dictionaries and inferences based on generalizing from the pronunciation dictionaries to convert a word to its spoken syllable/phonetic structure. In one embodiment an alternative for a return value is characterized as likely if it passes a similarity threshold. In order to determine how similar strings are, in one embodiment, the system is provisioned with a consonant/vowel confusability matrix which provides an indication of how likely a particular vowel or consonant is likely to be confused with another vowel or consonant. FIGS. 4A and B of the drawings shows one example of a consonant/vowel confusability matrix 400. Referring to FIGS. 4A and B, it will be seen that the vowel sound “ae” and the vowel sound “ay” have a high probability of being confused, whereas the vowel sound “oy” has a low probability of being confused with the consonant “k”. Each value in the matrix shown in FIGS. 4A and B of the drawings is computed based on linguistic research on how sounds are produced. For example this research indicates that B and P, which are known as bilabials are produced using the lips and, thus have a high degree of being confused. In one embodiment, each cell in the matrix of FIGS. 4A and B is a result of a “fitness function” which determines how closely aligned the two sounds are. In one embodiment, the fitness function uses the following assumptions:

-   -   (f) Vowels are highly fluid and are considered similar for all         long and short vowels;     -   (g) Dropped/missing characters decrease the value of the fitness         function;     -   (h) S characters, which are equivalent to a decrease in the         fitness function;     -   (i) Similar sounding characters such as B/P (bilabial         fricatives), S/F/V (labial—dental fricatives), TH/T/D, etc. are         considered to be a match;     -   (j) Characters that match early in a word are favored over ones         that match later in the word.

Once the strings are phoneticized, they need to be compared to one another to see if they are similar. In one embodiment an alternative for a return value is characterized as likely if it passes a similarity threshold. In order to determine how similar strings are, in one embodiment, the system is provisioned with a consonant/vowel confusability matrix which provides an indication of how likely a particular vowel or consonant is likely to be confused with another vowel or consonant. Another source of determining values for each cell in the matrix of FIGS. 4A and B takes into account how speech engines recognize sounds. For example, it is known that the S sound has low energy and would produce a match with other sounds.

In one embodiment, the comparison step at block 204 uses the consonant/vowel confusability matrix and a dynamic programming algorithm to compute a confusability number, which provides an indication of how confusable two strings are. In one embodiment, the dynamic programming algorithm may be the Smith-Waterman/Needleman-Wunsch algorithm or a derivative thereof. FIGS. 5A and B of the drawings shows a matrix 500, which is the output of a similarity comparison between the strings “McKesson Automation” and “McKesson Corporation”. The confusability number, which is at the lower right hand corner of the matrix, is equal to 77. If the confusability number is above a certain empirically determined threshold, for example say 50, then this indicates that the strings are highly confusable, whereas if the confusability number is low, say below 30, then this indicates that the confusability or degree of similarity between the strings is low.

In accordance with the techniques disclosed herein, if the confusability number is high for a given pair of strings, wherein a first string in the pair of strings is from the grammar for a first return value, and the second string in the pair of strings is from the grammar for a second return value and is not in the grammar for the first return value, then the second string is selected as a likely alternative for the first return value. Thus, a subset of return values comprising likely alternatives for each return value in the dictionary is constructed.

As noted above, column 306 of table 300 of FIG. 3 shows the alternative return values corresponding to each dictionary entry. Looking more closely at table 300, it will be seen that the string “American Roller” is in the list of alternative return values corresponding to the dictionary entry “American Century”, and that the string “American Century” is in the list of alternative return values for the dictionary entry “American Roller”. This is because a phonetic similarity comparison between the strings “American Century” and “American Roller” in accordance with the techniques disclosed herein has a high confusability number.

In one embodiment, in addition to identifying possible alternative return values based on a phonetic similarity threshold, possible alternative return values are also identified based on synonym relationships. For example, looking at the fifth dictionary entry in table 300, it will be seen that one synonym for “Alliance Data Systems” is the word “Alliance”. By looking at the grammar for the dictionary entry “Textron”, we note that the word “Alliance” is a synonym or alias for the dictionary entry “Textron”. Since, “Alliance” is a synonym for “Textron”, it is reasonable to assume that a caller/user may say “Alliance” in order to refer to “Textron”. Thus, because of this synonym relationship, the word “Textron” is added into the list of alternative return values for the dictionary entry “Alliance Data Systems”.

Referring again to FIG. 2 of the drawings, at block 206, the system selects a return value corresponding to the spoken input based on the grammar. The operations at block 206 are performed by a speech recognition engine of the system.

At block 208, if the selected return value is not confirmed by a user, then the system presents the likely alternatives for the selected return values to the user. For example in one embodiment in response to a spoken input, the system may select the return value “Adolph Coors Company”. This return value is presented to the user for confirmation. For example, the system may say “Do you mean Adolph Coors Company?”. In response, the user may say yes, and the dialogue may continue. However, if the system incorrectly selected the return value based on the spoken input, then the user will not confirm the selected return value, in which case the system will present the alternative return values to the user, for selection by the user. In this case, the alternative return values include “Rohm and Haas”, “The Sunday Times Company”, “Wells Fargo and Company”, “Textron”, “JB Hunt”, “American Roller”, “Starwood Hotel Resorts Worldwide”. The alternative return values are presented to the user in accordance with a predefined dialogue strategy. In one example, the dialogue strategy may include presenting all possible choices for the alternative return values to the user, at once. For example, the system may say:

-   -   “Okay, choices are 1. Rohm and Haas, 2. The Sunday Times         Company, 3. Wells Fargo and Company, 4. Textron, 5. JB Hunt, 6.         American Roller, 7. Starwood Hotels Resorts Worldwide.”

It will be seen that the above technique is an improvement over the N-Best technique of the prior art. For example, in the N-Best technique, the system will sequentially present every other dictionary entry besides the dictionary entry “Adolph Coors Company” to the user for selection, which is extremely annoying to the user.

Referring now to FIG. 6 of the drawings, there is shown a high-level block diagram of a speech recognition system 600 that may be used to implement the above techniques described with reference to FIG. 2 of the drawings. As will be seen, the system 600 includes logic to generate a dictionary 602, logic to generate a grammar 604, logic to analyze the grammar 606, logic to select the return value 608, and logic to present and confirm the selected return value, and the alternative return values. The logic to analyze the grammar 606 may include a phoneticization function 206.1, and a string compare function 206.2 as described.

Referring now to FIG. 7 of the drawings, there is shown a flow chart of operations performed by a speech recognition system, in accordance with another embodiment of the invention. Starting at block 700, the system selects a return value corresponding to a spoken input. This operation is performed using a speech recognition engine provisioned in the system. At block 702, the system confirms the selected return value with a user. The particular operations involved with regard to block 702 include entering a dialogue/conversation with a user in order to get confirmation that the selected return value is correct.

At block 704, the system generates a subset of alternative return values for the spoken input. The alternative return values are related to the selected return value in terms of a phonetic closeness threshold, or in terms of a synonym relationship, as described above.

At block 706, the system presents the alternative return values to the user for selection, as described above.

Referring now to FIG. 8 of the drawings, there is shown a high-level functional block diagram of a speech recognition system 800 that are used to implement the technique described with reference to FIG. 7. As will be seen, the system 800 includes logic 802 to select a return value, logic 804 to confirm the selected return value, logic 806 to generate a subset of alternative return values, and logic 808 to present the alternative return values. The logic 806 to generate the subset of alternative return values may include a phoneticization function 806.1, and a spring compare function 806.2, as described.

In one embodiment, the generation of the alternative return values is performed at compile time as opposed to at run time. This reduces latencies or delays in presenting the alternative return values to the user for selection.

In one embodiment, the strings in a grammar corresponding to words in a dictionary are analyzed based on the above-described techniques to identify strings that have a high likelihood of being confused or misrecognized. A user is notified of the strings that have a high likelihood of being confused so that the user can make changes to the grammar. This embodiment makes it possible to fine tune a grammar to minimize the occurrence of strings that could cause the system to misrecognize the strings.

Referring to FIG. 9 of the drawings, reference numeral 900 generally indicates hardware that may be used to implement embodiments of the speech recognition system of the present invention. The hardware 900 typically includes at least one processor 902 coupled to a memory 904. The processor 902 may represent one or more processors (e.g., microprocessors), and the memory 904 may represent random access memory (RAM) devices comprising a main storage of the hardware 900, as well as any supplemental levels of memory e.g., cache memories, non-volatile or back-up memories (e.g. programmable or flash memories), read-only memories, etc. In addition, the memory 904 may be considered to include memory storage physically located elsewhere in the hardware 900, e.g. any cache memory in the processor 902, as well as any storage capacity used as a virtual memory, e.g., as stored on a mass storage device 910.

The hardware 900 also typically receives a number of inputs and outputs for communicating information externally. For interface with a user or operator, the hardware 900 may include one or more user input devices 906 (e.g., a keyboard, a mouse, etc.) and a display 908 (e.g., a Cathode Ray Tube (CRT) monitor, a Liquid Crystal Display (LCD) panel).

For additional storage, the hardware 900 may also include one or more mass storage devices 910, e.g., a floppy or other removable disk drive, a hard disk drive, a Direct Access Storage Device (DASD), an optical drive (e.g. a Compact Disk (CD) drive, a Digital Versatile Disk (DVD) drive, etc.) and/or a tape drive, among others. Furthermore, the hardware 400 may include an interface with one or more networks 912 (e.g., a local area network (LAN), a wide area network (WAN), a wireless network, and/or the Internet among others) to permit the communication of information with other computers coupled to the networks. It should be appreciated that the hardware 900 typically includes suitable analog and/or digital interfaces between the processor 902 and each of the components 904, 906, 908 and 912 as is well known in the art.

The hardware 900 operates under the control of an operating system 914, and executes various computer software applications 916, components, programs, objects, modules, etc. (e.g. a program or module which performs operations described above). Moreover, various applications, components, programs, objects, etc. may also execute on one or more processors in another computer coupled to the hardware 900 via a network 912, e.g. in a distributed computing environment, whereby the processing required to implement the functions of a computer program may be allocated to multiple computers over a network.

In general, the routines executed to implement the embodiments of the invention, may be implemented as part of an operating system or a specific application, component, program, object, module or sequence of instructions referred to as “computer programs.” The computer programs typically comprise one or more instructions set at various times in various memory and storage devices in a computer, and that, when read and executed by one or more processors in a computer, cause the computer to perform operations necessary to execute elements involving the various aspects of the invention. Moreover, while the invention has been described in the context of fully functioning computers and computer systems, those skilled in the art will appreciate that the various embodiments of the invention are capable of being distributed as a program product in a variety of forms, and that the invention applies equally regardless of the particular type of machine or computer-readable media used to actually effect the distribution. Examples of computer-readable media include but are not limited to recordable type media such as volatile and non-volatile memory devices, floppy and other removable disks, hard disk drives, optical disks (e.g., Compact Disk Read-Only Memory (CD ROMS), Digital Versatile Disks, (DVDs), etc.), among others, and transmission type media such as digital and analog communication links.

Although the present invention has been described with reference to specific exemplary embodiments, it will be evident that the various modifications and changes can be made to these embodiments without departing from the broader spirit of the invention as set forth in the claims. Accordingly, the specification and drawings are to be regarded in an illustrative sense rather than in a restrictive sense. 

What is claimed is:
 1. A method, comprising: generating a dictionary comprising return values; generating a grammar for each return value in the dictionary; for each return value in the dictionary, analyzing the grammar to determine a subset of return values from the dictionary that are likely alternatives for the return value, comprising for each string in the grammar for the return value, comparing each string with every other string in the dictionary that is not in the grammar for that return value; when a first string in a pair of strings is from the grammar for a first return value, and a second string in the pair of strings is from the grammar for a second return value and is not in the grammar for the first return value, then selecting the second string as a likely alternative for the first return value, and constructing the subset of return values that are likely alternatives for each return value in the dictionary; if said comparison indicates that the strings are related based on one of a phonetic similarity threshold and a synonym relationship then adding the return value associated with the other string to the subset; and if the return value is not confirmed by a user, then presenting the return values in the subset for the return value to the user for selection, wherein the user is notified of each string that have a likelihood of being confused so that the user can make changes to the grammar.
 2. The method of claim 1 comprising selecting the first return value corresponding to a spoken input based on the grammar.
 3. The method of claim 1 comprising selecting a first return value based on the grammar.
 4. The method of claim 1, wherein comparing each string uses a dynamic programming algorithm.
 5. The method of claim 4, wherein the dynamic programming algorithm is based on the Smith-Waterman/Needleman-Wunsch algorithm.
 6. The method of claim 1, wherein the return values are associated with data provisioned in a speech recognition system.
 7. The method of claim 1, wherein the generating steps are performed at compile time as opposed to at runtime.
 8. A system, comprising: a memory configured to store logic instructions; and a processor configured to execute the logic instructions that when executed cause the logic instructions to: select a return value corresponding to a spoken input; generate a subset of alternative return values for the spoken input, wherein each alternative return value is related to the selected return value based on one of a synonym relationship and a phonetic similarity threshold between a grammar for the return value and the alternative return value; generate a first string in a pair of strings is from the grammar for a first return value, and a second string in the pair of strings is from the grammar for a second return value and is not in the grammar for the first return value, then selecting the second string as a likely alternative for the first return value, and constructing the subset of return values that are likely alternatives for each return value in a dictionary; and present the alternative return values to a user for selection, wherein the user is notified of each string that has a likelihood of being confused.
 9. The system of claim 8 wherein the logic instructions confirm the selected return value with the user.
 10. The system of claim 8, wherein the user can make changes to the grammar when each string has a likelihood of being confused.
 11. The system of claim 8, wherein the phonetic similarity threshold is calculated by comparing a phonetic representation of strings in the grammars for the return value and the alternative return value.
 12. The system of claim 11, wherein the phonetic similarity threshold is calculated using a dynamic programming algorithm.
 13. The system of claim 12, wherein the dynamic programming algorithm is based on the Smith-Waterman/Needleman-Wunsch algorithm.
 14. The system of claim 8, wherein the logic to generate the subset of alternative return values generates the return values at compile time as opposed to at runtime.
 15. The system of claim 8, further comprising logic to generate a grammar for each return value provisioned in the system.
 16. A non-transitory computer-readable medium, having stored thereon a sequence of instructions, which when executed by a computer processor, cause the computer processor to perform: generating a dictionary comprising return values; generating a grammar for each return value in the dictionary; for each return value in the dictionary, analyzing the grammar to determine a subset of return values from the dictionary that are likely alternatives for the return value comprising for each string in the grammar for the return value, comparing each string with every other string in the dictionary that is not in the grammar for that return value and if said comparison indicates that the strings are related based on one of a phonetic similarity threshold and a synonym relationship then adding the return value associated with the other string to the subset; when a first string in a pair of strings is from the grammar for a first return value, and a second string in the pair of strings is from the grammar for a second return value and is not in the grammar for the first return value, then selecting the second string as a likely alternative for the first return value, and constructing the subset of return values that are likely alternatives for each return value in the dictionary; and if the return value is not confirmed by a user, then presenting the return values in the subset for the first return value at once to the user for selection, wherein the user is notified of each string that has a likelihood of being confused so that the user can make changes to the grammar.
 17. A system, comprising: a processor; and a memory coupled to the processor, the memory storing instructions which when executed by the processor, cause the computer processor to perform: generating a dictionary comprising return values, generating a grammar for each return value in the dictionary; for each return value in the dictionary, analyzing the grammar to determine a subset of return values from the dictionary that are likely alternatives for the return value, comprising for each string in the grammar for the return value, comparing each string with every other string in the dictionary that is not in the grammar for that return value and if said comparison indicates that the strings are related based on one of a phonetic similarity threshold and a synonym relationship then adding the return value associated with the other string to the subset, when a first string in a pair of strings is from the grammar for a first return value, and a second string in the pair of strings is from the grammar for a second return value and is not in the grammar for the first return value, then selecting the second string as a likely alternative for the first return value, and constructing the subset of return values that are likely alternatives for each return value in the dictionary, and if the return value is not confirmed by a user, then presenting the return values in the subset for the first return value at once to the user for selection, wherein the user is notified of each string that has a high likelihood of being confused so that the user can make changes to the grammar.
 18. A non-transitory computer-readable storage medium, having stored thereon, a sequence of instructions which when executed by a computer processor, cause the computer processor to perform: selecting a return value corresponding to a spoken input; generating a subset of alternative return values for the spoken input, wherein the alternative return value is related to the selected return value based on one of a synonym relationship and a phonetic similarity threshold return value based on one of a synonym relationship and a phonetic similarity threshold between the grammars for the return value and the alternative return value; generating a first string in a pair of strings is from the grammar for a first return value, and a second string in the pair of strings is from the grammar for a second return value and is not in the grammar for the first return value, then selecting the second string as a likely alternative for the first return value, and constructing the subset of return values that are likely alternatives for each return value in a dictionary; and presenting the alternative return values to the user for selection, wherein the user is notified of a each string that has a likelihood of being confused so that the user can make changes to the grammar.
 19. A method, comprising: selecting a return value corresponding to a spoken input; generating a subset of alternative return values for the spoken input, wherein the alternative return value is related to the selected return value based on one of a synonym relationship and a phonetic similarity threshold between the grammars for the return value and the alternative return value; generating a first string in a pair of strings is from the grammar for a first return value, and a second string in the pair of strings is from the grammar for a second return value and is not in the grammar for the first return value, then selecting the second string as a likely alternative for the first return value, and constructing the subset of return values that are likely alternatives for each return value in a dictionary; and presenting the alternative return values to the user for selection, wherein the user is notified of each string that has a likelihood of being confused so that the user can make changes to the grammar.
 20. The method of claim 19, wherein the step of generating the subset of alternative return values is performed at compile time as opposed to at runtime. 